منابع مشابه
Generalised Logic Program Transformation Schemas
Schema-based logic program transformation has proven to be an eeective technique for the optimisation of programs. This paper results from the research that began by investigating the suggestions in 11] to construct a more general database of transformation schemas for optimising logic programs at the declarative level. The proposed transformation schemas fully automate accumulator introduction...
متن کاملConflicts in Generalised Modular Logic Programming
Modularity has been studied extensively in conventional logic programming and incorporating modularity into Answer Set Programming has also become popular in the last few years. A major approach is Oikarinnen and JanhunenÕs Gaifman-Shapiro-style architecture of program modules, which provides the composition of program modules. Recently one shortcoming to their approach, imposed in order to ens...
متن کاملTerm Declaration Logic and Generalised Composita
This paper gives a generalisation of a version of order sorted logic and an abstract axiomatic setting for the treatment of substitution. The two ideas are shown to be related, an equational speciication of term declaration logic being a presentation of a nitary generalised compositum. The axiomatic approach to substitution is compared with some others.
متن کاملOn the Logic of Generalised Metric Spaces
The aim of the paper is to work towards a generalisation of coalgebraic logic enriched over a commutative quantale. Previous work has shown how to dualise the coalgebra type functor T : Ω-Cat //Ω-Cat in order to obtain the modal operators and axioms describing transitions of type T . Here we give a logical description of the dual of Ω-Cat.
متن کاملGeneralised Unification of Temporal Logic Formulas
Given two temporal logic formulas, g and h, we wish to know whether there is a modification, m, we can make to h so that g =) h. This problem has important applications in hardware verification, where finding such modifications efficiently is important for an inferencing system. The temporal logic used, TL, is a relatively simple logic which is interpreted over finite state machine models. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1974
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093891197